Abstract: Promising advances in the field of quantum computing indicate a growing threat to cryptographic protocols based on integer factorization
نویسنده
چکیده
Promising advances in the field of quantum computing indicate a growing threat to cryptographic protocols based on integer factorization. To counter this threat, researchers have already designed and tested alternative protocols that do not rely on factorization. Quantum key distribution, a cryptographic mechanism that relies on the inherent randomness of quantum mechanics, serves not only as an option to replace techniques made vulnerable by quantum computing, but also as a more secure protocol that works fundamentally differently from previous cryptographic techniques. However, it is still subject to clever forms of eavesdropping and poses a significant challenge to implementation.
منابع مشابه
Post-Quantum Cryptography: S381 Cyclic Subgroup of High Order
—Currently there is an active Post-Quantum Cryptography (PQC) solutions search, which attempts to find cryptographic protocols resistant to attacks by means of for instance Shor's polynomial time algorithm for numerical field problems like integer factorization (IFP) or the discrete logarithm (DLP). The use of non-commutative or non-associative structures are, among others, valid choices for th...
متن کاملOn the WZ Factorization of the Real and Integer Matrices
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
متن کاملUse of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
Many cryptographic protocols derive their security from the apparent computational intractability of the integer factorization problem. Currently, the best known integer-factoring algorithms run in subexponential time. Efficient parallel implementations of these algorithms constitute an important area of practical research. Most reported implementations use multi-core and/or distributed paralle...
متن کاملProbabilistic Model – Checking of Quantum Protocols ( Extended
In the 1980s it was first realized that quantum–mechanical phenomena can be exploited directly for the manipulation, storage and transmission of information. The discovery of quantum algorithms for prime factorization [18] and unstructured search [7], which outperformed the best classical algorithms for these tasks significantly, opened up new vistas for computer science and gave an initial thr...
متن کاملFactoring as a Service
The difficulty of integer factorization is fundamental to modern cryptographic security using RSA encryption and signatures. Although a 512-bit RSA modulus was first factored in 1999, 512-bit RSA remains surprisingly common in practice across many cryptographic protocols. Popular understanding of the difficulty of 512-bit factorization does not seem to have kept pace with developments in comput...
متن کامل